Anyon computers with smaller groups

Anyons obtained from a finite gauge theory have a computational power that depends on the symmetry group. The relationship between group structure and computational power is discussed in this paper. In particular, it is shown that anyons based on finite groups that are solvable but not nilpotent are capable of universal quantum computation. This extends previously published results to groups that are smaller, and therefore more practical. Additionally, a new universal gate-set is built out of an operation called a probabilistic projection, and a quasi-universal leakage correction scheme is discussed.Comment: 28 pages, REVTeX 4 (minor corrections in v2

A large family of quantum weak coin-flipping protocols

Each classical public-coin protocol for coin flipping is naturally associated with a quantum protocol for weak coin flipping. The quantum protocol is obtained by replacing classical randomness with quantum entanglement and by adding a cheat detection test in the last round that verifies the integrity of this entanglement. The set of such protocols defines a family which contains the protocol with bias 0.192 previously found by the author, as well as protocols with bias as low as 1/6 described herein. The family is analyzed by identifying a set of optimal protocols for every number of messages. In the end, tight lower bounds for the bias are obtained which prove that 1/6 is optimal for all protocols within the family.Comment: 17 pages, REVTeX 4 (minor corrections in v2

Serial composition of quantum coin-flipping, and bounds on cheat detection for bit-commitment

Quantum protocols for coin-flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in the bias (or bit-commitment protocols with linear cheat detection) because these can be composed to produce strong coin-flipping with arbitrarily small bias. On the other hand, it appears that quadratic cheat detection cannot be composed in series to obtain even weak coin-flipping with arbitrarily small bias.Comment: 7 pages, REVTeX 4 (minor corrections in v2

Anyons from nonsolvable finite groups are sufficient for universal quantum computation

We present a constructive proof that anyonic magnetic charges with fluxes in a nonsolvable finite group can perform universal quantum computations. The gates are built out of the elementary operations of braiding, fusion, and vacuum pair creation, supplemented by a reservoir of ancillas of known flux. Procedures for building the ancilla reservoir and for correcting leakage are also described. Finally, a universal qudit gate set, which is ideally suited for anyons, is presented. The gate set consists of classical computation supplemented by measurements of the X operator

Tools for Quantum Algorithms

We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations, approximations of transformations and generalizations of the phase adjustments to block matrix transformations. These operations generalize those used in proposed quantum search algorithms.Comment: LATEX, 15 pages, Minor changes: one author's e-mail and one reference numbe

A System for Personality and Happiness Detection

This work proposes a platform for estimating personality and happiness. Starting from Eysenck's theory about human's personality, authors seek to provide a platform for collecting text messages from social media (Whatsapp), and classifying them into different personality categories. Although there is not a clear link between personality features and happiness, some correlations between them could be found in the future. In this work, we describe the platform developed, and as a proof of concept, we have used different sources of messages to see if common machine learning algorithms can be used for classifying different personality features and happiness

Hamiltonian Oracles

Hamiltonian oracles are the continuum limit of the standard unitary quantum oracles. In this limit, the problem of finding the optimal query algorithm can be mapped into the problem of finding shortest paths on a manifold. The study of these shortest paths leads to lower bounds of the original unitary oracle problem. A number of example Hamiltonian oracles are studied in this paper, including oracle interrogation and the problem of computing the XOR of the hidden bits. Both of these problems are related to the study of geodesics on spheres with non-round metrics. For the case of two hidden bits a complete description of the geodesics is given. For n hidden bits a simple lower bound is proven that shows the problems require a query time proportional to n, even in the continuum limit. Finally, the problem of continuous Grover search is reexamined leading to a modest improvement to the protocol of Farhi and Gutmann.Comment: 16 pages, REVTeX 4 (minor corrections in v2

A pilot investigation of the potential for incorporating lifelog technology into executive function rehabilitation for enhanced transfer of self-regulation skills to everyday life

The objective of the study was to identify the potential target and effect size of goal management training (GMT) enhanced with life-logging technology compared with standard GMT on a range of possible primary outcomes reflecting cognitive and ecological aspects of executive functioning and quality of life. Sixteen patients with acquired brain injury involving executive dysfunction were randomly allocated to one of the two interventions: seven weeks of GMT (n = 8), or seven weeks of GMT+Lifelog (n = 8). Outcome measures included a battery of executive function tests, the Dysexecutive Questionnaire (DEX) and the Quality of Life after Brain Injury scale (QOLIBRI), measured pre- and post-interventions. Within-group changes were assessed with related-samples t-tests and estimation of effect sizes. GMT+Lifelog was associated with significant changes, of medium to large effect size, in response inhibition (Stroop), multitasking (Strategy Application and Multiple Errand tests), DEX Intentionality and Positive Affect subscales and QOLIBRI Daily Life and Autonomy, subscales. GMT alone was associated with significant changes of overall quality of life. It was concluded that GMT+Lifelog holds promise to optimise the impact of GMT on executive dysfunction and quality of life